On diagonal dominance arguments for bounding ‖A-1‖∞

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Diagonal arguments and fixed points

‎A universal schema for diagonalization was popularized by N.S‎. ‎Yanofsky (2003)‎, ‎based on a pioneering work of F.W‎. ‎Lawvere (1969)‎, ‎in which the existence of a (diagonolized-out and contradictory) object implies the existence of a fixed-point for a certain function‎. ‎It was shown that many self-referential paradoxes and diagonally proved theorems can fit in that schema‎. ‎Here‎, ‎we fi...

متن کامل

Diagonal Dominance and Harmless Off-diagonal Delays

Systems of linear differential equations with constant coefficients, as well as Lotka–Volterra equations, with delays in the off–diagonal terms are considered. Such systems are shown to be asymptotically stable for any choice of delays if and only if the matrix has a negative weakly dominant diagonal.

متن کامل

Diagonal Dominance and Harmless O -Diagonal Delays1

Systems of linear diierential equations with constant coeecients, as well as Lotka{Volterra equations, with delays in the oo{diagonal terms are considered. Such systems are shown to be asymptotically stable for any choice of delays if and only if the matrix has a negative weakly dominant diagonal.

متن کامل

Diagonal Dominance and Positive

We dedicate this paper to Professor Ron Mitchell who has been an inspiration to many generations of numerical analysts. In addition his generous spirit has infused our discipline with a sense of positive endeavour. We examine whether three diierent upwind schemes for the positive definite advection diiusion problem can yield indeenite coeecient matrices. In particular, in line with the increasi...

متن کامل

Multilevel ILU With Reorderings for Diagonal Dominance

This paper presents a preconditioning method based on combining two-sided permutations with a multilevel approach. The nonsymmetric permutation exploits a greedy strategy to put large entries of the matrix in the diagonal of the upper leading submatrix. The method can be regarded as a complete pivoting version of the incomplete LU factorization. This leads to an effective incomplete factorizati...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linear Algebra and its Applications

سال: 1976

ISSN: 0024-3795

DOI: 10.1016/0024-3795(76)90067-7